Threshold tolerance graphs
نویسندگان
چکیده
In this paper, we introduce a class of graphs that generalize threshold graphs by introducing threshold tolerances. Several characterizations of these graphs are presented, one of which leads to a polynomial-time recognition algorithm. It is also shown that the complements of these graphs contain interval graphs and threshold graphs, and are contained in the subclass of chordal graphs called strongly chordal graphs, and in the class of interval tolerance graphs.
منابع مشابه
Relating threshold tolerance graphs to other graph classes
A graph G = (V, E) is a threshold tolerance if it is possible to associate weights and tolerances with each node of G so that two nodes are adjacent exactly when the sum of their weights exceeds either one of their tolerances. Threshold tolerance graphs are a special case of the well-known class of tolerance graphs and generalize the class of threshold graphs which are also extensively studied ...
متن کامل- tolerance chain graphs
Jacobson, MS., J. Lehel and L.M. Lesniak, @threshold and $-tolerance chain graphs, Discrete Applied Mathematics 44 (1993) 191-203. In this paper we introduce a class of graphs called $-threshold graphs which generalize threshold graphs. These graphs are studied for various functions I+? that include “max” and “min” as special cases. The graphs are then shown to fit into the more general setting...
متن کاملOn recognition of threshold tolerance graphs and their complements
A graph G = (V,E) is a threshold tolerance graph if each vertex v ∈ V can be assigned a weight wv and a tolerance tv such that two vertices x, y ∈ V are adjacent if wx +wy ≥ min(tx, ty). Currently, the most efficient recognition algorithm for threshold tolerance graphs is the algorithm of Monma, Reed, and Trotter which has an O(n) runtime. We give an O(n) algorithm for recognizing threshold tol...
متن کاملRecognizing Threshold Tolerance Graphs in O(n2) Time
A graph G = (V,E) is a threshold tolerance graph if each vertex v ∈ V can be assigned a weight wv and a tolerance tv such that two vertices x, y ∈ V are adjacent if wx +wy ≥ min(tx, ty). Currently, the most efficient recognition algorithm for threshold tolerance graphs is the algorithm of Monma, Reed, and Trotter which has an O(n) runtime. We give an O(n) algorithm for recognizing threshold tol...
متن کاملRank-tolerance graph classes
In this paper we introduce certain classes of graphs that generalize φ-tolerance chain graphs. In a rank-tolerance representation of a graph, each vertex is assigned two parameters: a rank, which represents the size of that vertex, and a tolerance which represents an allowed extent of conflict with other vertices. Two vertices are adjacent if and only if their joint rank exceeds (or equals) the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Graph Theory
دوره 12 شماره
صفحات -
تاریخ انتشار 1988